An Optimistic Planning Approach for the Aircraft Landing Problem

The Aircraft Landing Problem consists in sequencing aircraft on the available runways and scheduling their landing times taking into consideration several operational constraints, order to increase runway capacity and/or reduce delays. In this work we propose a new Mixed Integer Programming (MIP) model for landings single or multiple independent incorporating safety constraints by means of separation between at threshold. Due NP-hardness problem, solving directly MIP large realistic instances yields redhibitory computation times. Therefore, introduce novel heuristic search methodology based Optimistic Planning that significantly improve FCFS (First-Come First-Served) solution, provides good-quality solutions reasonable computational time. solution approach is then tested medium generated from real-world traffic Paris-Orly airport show benefit our approach.